Matrix partitions of split graphs
نویسندگان
چکیده
منابع مشابه
Matrix Partitions of Split Graphs
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split graphs. Previously such a result was only known for the class of cographs. (In particular, there are matrix partition problems which have infinitely many mini...
متن کاملPartitions of Generalized Split Graphs
We discuss matrix partition problems for graphs that admit a partition into k independent sets and ` cliques. We show that when k + ` 6 2, any matrix M has finitely many (k, `) minimal obstructions and hence all of these problems are polynomial time solvable. We provide upper bounds for the size of any (k, `) minimal obstruction when k = ` = 1 (split graphs), when k = 2, ` = 0 (bipartite graphs...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملMatrix partitions of perfect graphs
Given a symmetric m by m matrix M over 0, 1, ∗, the M -partition problem asks whether or not an input graph G can be partitioned into m parts corresponding to the rows (and columns) of M so that two distinct vertices from parts i and j (possibly with i = j) are nonadjacent if M(i, j) = 0, and adjacent if M(i, j) = 1. These matrix partition problems generalize graph colourings and homomorphisms,...
متن کاملList matrix partitions of chordal graphs
It is well known that a clique with k + 1 vertices is the only minimal obstruction to k-colourability of chordal graphs. A similar result is known for the existence of a cover by cliques. Both of these problems are in fact partition problems, restricted to chordal graphs. The first seeks partitions into k independent sets, and the second is equivalent to finding partitions into cliques. In an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.016